Indexing for semantic cache to reduce query matching complexity
نویسندگان
چکیده
منابع مشابه
Fast indexing for blocked array layouts to reduce cache misses
The increasing disparity between memory latency and processor speed is a critical bottleneck in achieving high performance. Recently, several studies have been conducted on blocked data layouts, in conjunction with loop tiling to improve locality of references. In this paper, we further reduce cache misses, restructuring the memory layout of multi-dimensional arrays, so that array elements are ...
متن کاملXml Query Processing – Semantic Cache System
With the advent of XML, great challenges arise from the demand for efficiently retrieving information from remote XML sources across the Internet. Recently, the advance of extensible Markup Language (XML) as the lingua franca of the Web meets the needs for an interoperable data exchange format on the Web. The semantic caching technology can help to improve the efficiency of XML query processing...
متن کاملLatent Semantic Indexing with selective Query Expansion
This article describes our experiments during participation in the Legal Track of the 2011 Text Retrieval Conference. We incorporated machine learning, via selective query expansion, into our existing EDLSI system. We also were able to expand the number of dimensions used within our EDLSI system. Our results show that EDLSI is an effective technique for E-Discovery. We also have shown that sele...
متن کاملUB-Tree Indexing for Semantic Query Optimization of Range Queries
Semantic query optimization consists in restricting the search space in order to reduce the set of objects of interest for a query. This paper presents an indexing method based on UB-trees and a static analysis of the constraints associated to the views of the database and to any constraint expressed on attributes. The result of the static analysis is a partitioning of the object space into dis...
متن کاملVery low-dimensional latent semantic indexing for local query regions
In this paper, we focus on performing LSI on very low SVD dimensions. The results show that there is a nearly linear surface in the local query region. Using low-dimensional LSI on local query region we can capture such a linear surface, obtain much better performance than VSM and come comparably to global LSI. The surprisingly small requirements of the SVD dimension resolve the computation res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the National Science Foundation of Sri Lanka
سال: 2017
ISSN: 2362-0161,1391-4588
DOI: 10.4038/jnsfsr.v45i1.8033